A Superlinearly Convergent Polynomial Primal-Dual Interior-Point Algorithm for Linear Programming
نویسندگان
چکیده
منابع مشابه
A Superlinearly Convergent Primal-Dual Infeasible-Interior-Point Algorithm for Semidefinite Programming
We propose a primal-dual infeasible-interior-point path-following algorithm for solving semideenite programming (SDP) problems. If the problem has a solution, then the algorithm is globally convergent. If the starting point is feasible or close to being feasible , the algorithms nds an optimal solution in at most O(p nL) iterations. If the starting point is large enough then the algorithm termi...
متن کاملA Primal-Dual Interior Point Algorithm for Linear Programming
This chapter presents an algorithm that works simultaneously on primal and dual linear programming problems and generates a sequence of pairs of their interior feasible solutions. Along the sequence generated, the duality gap converges to zero at least linearly with a global convergence ratio (1 Yf/n); each iteration reduces the duality gap by at least Yf/n. Here n denotes the size of the probl...
متن کاملA globally convergent primal-dual interior point algorithm for convex programming
In this paper, we study the global convergence of a large class of primal--dual interior point algorithms for solving the linearly constrained convex programming problem. The algorithms in this class decrease the value of a primal--dual potential function and hence belong to the class of so-called potential reduction algorithms. An inexact line search based on Armijo stepsize rule is used to co...
متن کاملA Polynomial Primal-Dual Dikin-Type Algorithm for Linear Programming
No part of this report may be reproduced in any form, by print, photoprint, microolm or any other means without written permis
متن کاملABS Solution of equations of second kind and application to the primal-dual interior point method for linear programming
Abstract We consider an application of the ABS procedure to the linear systems arising from the primal-dual interior point methods where Newton method is used to compute path to the solution. When approaching the solution the linear system, which has the form of normal equations of the second kind, becomes more and more ill conditioned. We show how the use of the Huang algorithm in the ABS cl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Optimization
سال: 1993
ISSN: 1052-6234,1095-7189
DOI: 10.1137/0803006